منابع مشابه
An Advanced Approach to Solve two Counterfeit Coins Problem
Though the counterfeit coin problem is well known as a fascinating puzzle it claims great importance in Computer science, Game theory, and Mathematics. In terms of the puzzle the objective is to detect the counterfeit coins which are identical in appearance but different in weight. The word counterfeit not only describes forgeries of currency or documents, but can also be applied to software, p...
متن کاملSelecting two different defective coins q
In this paper, given a balance scale and the information that there are exactly two different defective coins present, the authors consider the problem of ascertaining the minimum number of testing which suffice to determine the two different defective coins in a set of k coins in same appearance, and here k P 3. A testing algorithm for all the possible values of k is constructed, and the testi...
متن کاملElemental Analysis of Two Rupee Indian Coins by EDXRF Technique
Energy Dispersive X-Ray Fluorescence (EDXRF) technique has been used to study two Rupee Indian coins minted during the period 1993 to 2010 for their elemental concentrations. From the analysis of the coins, it is found that the coins are made of binary alloy and it was observed that from 2005 onwards, the composition of the coins has been changed from Cupro-Nickel to Ferritic Stainless Steel (F...
متن کاملSimulating a die roll by flipping two coins
We show how to simulate a roll of a fair n-sided die by one flip of a biased coin with probability 1/n of coming up heads, followed by 3⌊log 2 n⌋+ 1 flips of a fair coin. Let a p-coin be a biased coin with probability p of coming up heads. A fair coin is a (1/2)-coin. A fair n-sided die is a die with n sides, each of which comes up with probability 1/n when the die is rolled. Proposition 1. For...
متن کاملMoving coins
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, and moves are defined as collision free translations, all in the Euclidean plane. We obtain combinatorial bounds on the number of moves that are necessary and/or sufficient to move coins from one configuration to anothe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1983
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90123-1